ONLINE JOB PORTAL FOR LOCAL HUB CONNECTIVITY

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Open Source Portal Framework for Job Submission

This paper describes the Open Source Portal Framework (OSPF) for job submission to grid, which is developed based on JSR168 Portlet standard, with GridSphere Portal Framework, Globus Middleware and Gridway Meta-Scheduler. OSPF is providing web portal interface for Open Source Grid Community with the ultimate aim of accessing the distributed computing resources. This portal framework provisions ...

متن کامل

Motor Coordination: A Local Hub for Coordination

A local interneuron of a crayfish central pattern generator serves as a hub that integrates ascending and descending coordinating information and passes it on to a local oscillatory microcircuit to coordinate a series of segmental appendages known as swimmerets.

متن کامل

digiMe: An Online Portal to Support Connectivity through E-Learning in Medical Education

Connectivity is intrinsic to all aspects of our life today, be it political, economic, technological, scientific, or personal. Higher education is also transcending the previous paradigm of technology enabled content delivery and e-learning, with a new emphasis on connectivity, enabling participants to exchange knowledge and collaborate to meet educational goals. In this study, a social media t...

متن کامل

Online Job Admission

We consider the problem of scheduling a maximum profit selection of jobs on m identical machines. Jobs arrive online one by one and each job is specified by its start and end time. The goal is to determine a non-preemptive schedule which maximizes the profit of the scheduled jobs, where the profit of a job is equal to its length. Upon arrival of a new job, an online algorithm must decide whethe...

متن کامل

Maximizing Job Completions Online

We consider the problem of maximizing the number of jobs completed by their deadline in an online single processor system where the jobs are preemptable and have release times. So in the standard three eld scheduling notation, this is the online version of the problem 1 j r i ; pmtn j P (1 ? U i). We present a deterministic algorithm Lax, and show that for every instance I, it is the case that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: INTERNATIONAL JOURNAL OF RECENT TRENDS IN ENGINEERING & RESEARCH

سال: 2020

ISSN: 2455-1457

DOI: 10.23883/ijrter.2020.6011.2bevv